The aligned rank transform and discrete variables: A warning

Six Modifications Of The Aligned Rank Transform Test For Interaction

Discrete Convolution and the Discrete Fourier Transform

Discrete Convolution First of all we need to introduce what we might call the “wraparound” convention. Because the complex numbers wj = e i 2πj N have the property wj±N = wj, which readily extends to wj+mN = wj for any integer m, and since in the discrete Fourier context we represent all N -dimensional vectors as linear combinations of the Fourier vectors Wk whose components are wkj , we make t...

Sampling Rate Conversion in the Discrete Linear Canonical Transform Domain

Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...

A Discrete Zak Transform

A discrete version of the Zak transform is defined and used to analyze discrete Weyl–Heisenberg frames, which are nonorthogonal systems in the space of square-summable sequences that, although not necessarily bases, provide representations of square-summable sequences as sums of the frame elements. While the general theory is essentially similar to the continuous case, major differences occur w...

Image Compression Using Discrete Wavelet Transform And Discrete Cosine Transform

The area of digital image processing has witness a great deal of development during the past few decades. Image compression is one of most important aspects of the fields. The paper presents simple and efficient algorithm for compressing image data, the algorithm involved using the glory wavelet transform technique, which was the most usable method for varied image processing field due to its r...